Kotlin Computational Geometry/io.github.cponfick.kompgeom.algorithms.closestpair

Package-level declarations

Types

ClosestPair

interface ClosestPair<V : Vector<V>> : Algorithm<Result<V>>

Interface for closest pair algorithms.

ClosestPairDivideAndConquer

class ClosestPairDivideAndConquer<V : Vector2<V>>(input: Collection<V>) : ClosestPair<V>

Closest Pair algorithm using the Divide and Conquer approach.

ClosestPairNaive

class ClosestPairNaive<V : Vector<V>>(input: Collection<V>) : ClosestPair<V>

Closest Pair algorithm using the Divide and Conquer approach. This implementation sorts the points by x and y coordinates and recursively finds the closest pair.

Result

class Result<V : Vector<V>>(val distance: Double, val result: Pair<V, V>)

Represents the result of the closest pair algorithm.